Cascading runlength-limited sequences
نویسندگان
چکیده
منابع مشابه
Cascading methods for runlength-limited arrays
Runlength-limited sequences and arrays have found applications in magnetic and optical recording. While the constrained sequences are well studied, little is known about constrained arrays. In this correspondence we consider the question of how to cascade two arrays with the same runlength constraints horizontally and vertically, in such a way that the runlength constraints will not be violated...
متن کاملRunlength-Limited Sequences and Shift-Correcting Codes
This work is motivated by the problem of error correction in bit-shift channels with the so-called (d, k) input constraints (where successive 1’s are required to be separated by at least d and at most k zeros, 0 ≤ d < k ≤ ∞). Bounds on the size of optimal (d, k)-constrained codes correcting a fixed number of bit-shifts are derived. The upper bound is obtained by a packing argument, while the lo...
متن کاملAn enumerative coding technique for DC-free runlength-limited sequences
We present an enumerative technique for encoding and decoding dc-free runlength-limited sequences. This technique enables the encoding and decoding of sequences approaching the maxentropic performance bounds very closely in terms of code rate and low-frequency suppression capability. Use of finite-precision floating-point notation to express the weight coefficients results in channel encoders a...
متن کاملOn runlength-limited coding with DC control
Constructions are presented of nite state encoders for certain d k RLL con straints with DC control In particular an example is provided for a rate encoder for the RLL constraint that requires no look ahead in decoding thus performing favorably compared to the EFMPlus code used in the DVD standard
متن کاملNested block decodable runlength-limited codes
Consider a d k RLL constraint that is contained in a d k RLL con straint where k d and d and x a codeword length q k It is shown that whenever there exist block decodable encoders with codeword length q for those two constraints there exist such encoders where one is a subgraph of the other furthermore both encoders can be decoded by essentially the same de coder Speci cally a d k RLL constrain...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 1993
ISSN: 0018-9448
DOI: 10.1109/18.265507